Averest: Specification, Verification, and Implementation of Reactive Systems

Figure 1 shows the Averest design flow: A given Quartz program is first translated to a symbolically represented transition system in Averest’s Interchange Format AIF that is based on XML. Temporal logic specifications are thereby translated to alternating ω-automata and/or μ-calculus formulas. Depending on the used data types (integers with limited or unlimited bitwidth), the resulting transition systems have finitely or infinitely many states. The AIF description can then be used for verification and for code generation. In the following, we briefly describe the main tools of Averest, i.e., Ruby, Beryl, and Topaz.